TSTP Solution File: SEV121^5 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : SEV121^5 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% Computer : n021.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Tue Jul 19 17:35:10 EDT 2022
% Result : Theorem 0.20s 0.39s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 5
% Syntax : Number of formulae : 38 ( 21 unt; 4 typ; 0 def)
% Number of atoms : 151 ( 95 equ; 0 cnn)
% Maximal formula atoms : 3 ( 4 avg)
% Number of connectives : 214 ( 39 ~; 44 |; 0 &; 126 @)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 61 ( 61 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 4 usr; 4 con; 0-2 aty)
% Number of variables : 99 ( 38 ^ 61 !; 0 ?; 99 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_sK1_SV1,type,
sK1_SV1: $i ).
thf(tp_sK2_SV2,type,
sK2_SV2: $i ).
thf(tp_sK3_SY16,type,
sK3_SY16: $i > $i > $o ).
thf(tp_sK4_SY18,type,
sK4_SY18: ( $i > $i > $o ) > $i ).
thf(1,conjecture,
( ( ^ [Xu: $i,Xv: $i] : ( Xu = Xv ) )
= ( ^ [Xx: $i,Xy: $i] :
! [Xp: $i > $i > $o] :
( ! [Xx0: $i] : ( Xp @ Xx0 @ Xx0 )
=> ( Xp @ Xx @ Xy ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM47C_pme) ).
thf(2,negated_conjecture,
( ( ( ^ [Xu: $i,Xv: $i] : ( Xu = Xv ) )
= ( ^ [Xx: $i,Xy: $i] :
! [Xp: $i > $i > $o] :
( ! [Xx0: $i] : ( Xp @ Xx0 @ Xx0 )
=> ( Xp @ Xx @ Xy ) ) ) )
= $false ),
inference(negate_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( ( ^ [Xu: $i,Xv: $i] : ( Xu = Xv ) )
= ( ^ [Xx: $i,Xy: $i] :
! [Xp: $i > $i > $o] :
( ! [Xx0: $i] : ( Xp @ Xx0 @ Xx0 )
=> ( Xp @ Xx @ Xy ) ) ) )
= $false ),
inference(unfold_def,[status(thm)],[2]) ).
thf(4,plain,
( ( ( ( ^ [Xu: $i,Xv: $i] : ( Xu = Xv ) )
!= ( ^ [Xx: $i,Xy: $i] :
! [Xp: $i > $i > $o] :
( ! [Xx0: $i] : ( Xp @ Xx0 @ Xx0 )
=> ( Xp @ Xx @ Xy ) ) ) ) )
= $true ),
inference(polarity_switch,[status(thm)],[3]) ).
thf(5,plain,
( ( ( ( ^ [Xu: $i,Xv: $i] : ( Xu = Xv ) )
!= ( ^ [Xx: $i,Xy: $i] :
! [Xp: $i > $i > $o] :
( ! [Xx0: $i] : ( Xp @ Xx0 @ Xx0 )
=> ( Xp @ Xx @ Xy ) ) ) ) )
= $true ),
inference(copy,[status(thm)],[4]) ).
thf(6,plain,
( ( ( ( ^ [SX0: $i,SX1: $i] : ( SX0 = SX1 ) )
!= ( ^ [SX0: $i,SX1: $i] :
! [SX2: $i > $i > $o] :
( ~ ! [SX3: $i] : ( SX2 @ SX3 @ SX3 )
| ( SX2 @ SX0 @ SX1 ) ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[5]) ).
thf(7,plain,
( ( ( ^ [SX0: $i,SX1: $i] : ( SX0 = SX1 ) )
= ( ^ [SX0: $i,SX1: $i] :
! [SX2: $i > $i > $o] :
( ~ ! [SX3: $i] : ( SX2 @ SX3 @ SX3 )
| ( SX2 @ SX0 @ SX1 ) ) ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[6]) ).
thf(8,plain,
( ( ! [SV1: $i] :
( ( ^ [SY6: $i] : ( SV1 = SY6 ) )
= ( ^ [SY7: $i] :
! [SY8: $i > $i > $o] :
( ~ ! [SX3: $i] : ( SY8 @ SX3 @ SX3 )
| ( SY8 @ SV1 @ SY7 ) ) ) ) )
= $false ),
inference(extcnf_equal_neg,[status(thm)],[7]) ).
thf(9,plain,
( ( ( ^ [SX0: $i,SX1: $i] : ( SX0 = SX1 ) )
= ( ^ [SX0: $i,SX1: $i] :
! [SX2: $i > $i > $o] :
( ~ ! [SX3: $i] : ( SX2 @ SX3 @ SX3 )
| ( SX2 @ SX0 @ SX1 ) ) ) )
= $false ),
inference(extcnf_equal_neg,[status(thm)],[7]) ).
thf(10,plain,
( ( ( ^ [SY10: $i] : ( sK1_SV1 = SY10 ) )
= ( ^ [SY11: $i] :
! [SY12: $i > $i > $o] :
( ~ ! [SX3: $i] : ( SY12 @ SX3 @ SX3 )
| ( SY12 @ sK1_SV1 @ SY11 ) ) ) )
= $false ),
inference(extcnf_forall_neg,[status(esa)],[8]) ).
thf(11,plain,
( ( ! [SV2: $i] :
( ( sK1_SV1 = SV2 )
= ( ! [SY14: $i > $i > $o] :
( ~ ! [SX3: $i] : ( SY14 @ SX3 @ SX3 )
| ( SY14 @ sK1_SV1 @ SV2 ) ) ) ) )
= $false ),
inference(extcnf_equal_neg,[status(thm)],[10]) ).
thf(12,plain,
( ( ( ^ [SY10: $i] : ( sK1_SV1 = SY10 ) )
= ( ^ [SY11: $i] :
! [SY12: $i > $i > $o] :
( ~ ! [SX3: $i] : ( SY12 @ SX3 @ SX3 )
| ( SY12 @ sK1_SV1 @ SY11 ) ) ) )
= $false ),
inference(extcnf_equal_neg,[status(thm)],[10]) ).
thf(13,plain,
( ( ( sK1_SV1 = sK2_SV2 )
= ( ! [SY16: $i > $i > $o] :
( ~ ! [SX3: $i] : ( SY16 @ SX3 @ SX3 )
| ( SY16 @ sK1_SV1 @ sK2_SV2 ) ) ) )
= $false ),
inference(extcnf_forall_neg,[status(esa)],[11]) ).
thf(14,plain,
( ( ~ ( ( sK1_SV1 = sK2_SV2 )
| ! [SY16: $i > $i > $o] :
( ~ ! [SX3: $i] : ( SY16 @ SX3 @ SX3 )
| ( SY16 @ sK1_SV1 @ sK2_SV2 ) ) )
| ~ ( ( sK1_SV1 != sK2_SV2 )
| ~ ! [SY16: $i > $i > $o] :
( ~ ! [SX3: $i] : ( SY16 @ SX3 @ SX3 )
| ( SY16 @ sK1_SV1 @ sK2_SV2 ) ) ) )
= $false ),
inference(extcnf_equal_neg,[status(thm)],[13]) ).
thf(15,plain,
( ( ( sK1_SV1 = sK2_SV2 )
= ( ! [SY16: $i > $i > $o] :
( ~ ! [SX3: $i] : ( SY16 @ SX3 @ SX3 )
| ( SY16 @ sK1_SV1 @ sK2_SV2 ) ) ) )
= $false ),
inference(extcnf_equal_neg,[status(thm)],[13]) ).
thf(16,plain,
( ( ~ ( ( sK1_SV1 = sK2_SV2 )
| ! [SY16: $i > $i > $o] :
( ~ ! [SX3: $i] : ( SY16 @ SX3 @ SX3 )
| ( SY16 @ sK1_SV1 @ sK2_SV2 ) ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[14]) ).
thf(17,plain,
( ( ~ ( ( sK1_SV1 != sK2_SV2 )
| ~ ! [SY16: $i > $i > $o] :
( ~ ! [SX3: $i] : ( SY16 @ SX3 @ SX3 )
| ( SY16 @ sK1_SV1 @ sK2_SV2 ) ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[14]) ).
thf(18,plain,
( ( ( sK1_SV1 = sK2_SV2 )
| ! [SY16: $i > $i > $o] :
( ~ ! [SX3: $i] : ( SY16 @ SX3 @ SX3 )
| ( SY16 @ sK1_SV1 @ sK2_SV2 ) ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[16]) ).
thf(19,plain,
( ( ( sK1_SV1 != sK2_SV2 )
| ~ ! [SY16: $i > $i > $o] :
( ~ ! [SX3: $i] : ( SY16 @ SX3 @ SX3 )
| ( SY16 @ sK1_SV1 @ sK2_SV2 ) ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[17]) ).
thf(20,plain,
( ( ( sK1_SV1 = sK2_SV2 )
= $true )
| ( ( ! [SY16: $i > $i > $o] :
( ~ ! [SX3: $i] : ( SY16 @ SX3 @ SX3 )
| ( SY16 @ sK1_SV1 @ sK2_SV2 ) ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[18]) ).
thf(21,plain,
( ( ( ( sK1_SV1 != sK2_SV2 ) )
= $true )
| ( ( ~ ! [SY16: $i > $i > $o] :
( ~ ! [SX3: $i] : ( SY16 @ SX3 @ SX3 )
| ( SY16 @ sK1_SV1 @ sK2_SV2 ) ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[19]) ).
thf(22,plain,
! [SV3: $i > $i > $o] :
( ( ( ~ ! [SY18: $i] : ( SV3 @ SY18 @ SY18 )
| ( SV3 @ sK1_SV1 @ sK2_SV2 ) )
= $true )
| ( ( sK1_SV1 = sK2_SV2 )
= $true ) ),
inference(extcnf_forall_pos,[status(thm)],[20]) ).
thf(23,plain,
( ( ( sK1_SV1 = sK2_SV2 )
= $false )
| ( ( ~ ! [SY16: $i > $i > $o] :
( ~ ! [SX3: $i] : ( SY16 @ SX3 @ SX3 )
| ( SY16 @ sK1_SV1 @ sK2_SV2 ) ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[21]) ).
thf(24,plain,
! [SV3: $i > $i > $o] :
( ( ( ~ ! [SY18: $i] : ( SV3 @ SY18 @ SY18 ) )
= $true )
| ( ( SV3 @ sK1_SV1 @ sK2_SV2 )
= $true )
| ( ( sK1_SV1 = sK2_SV2 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[22]) ).
thf(25,plain,
( ( ( ! [SY16: $i > $i > $o] :
( ~ ! [SX3: $i] : ( SY16 @ SX3 @ SX3 )
| ( SY16 @ sK1_SV1 @ sK2_SV2 ) ) )
= $false )
| ( ( sK1_SV1 = sK2_SV2 )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[23]) ).
thf(26,plain,
! [SV3: $i > $i > $o] :
( ( ( ! [SY18: $i] : ( SV3 @ SY18 @ SY18 ) )
= $false )
| ( ( SV3 @ sK1_SV1 @ sK2_SV2 )
= $true )
| ( ( sK1_SV1 = sK2_SV2 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[24]) ).
thf(27,plain,
( ( ( ~ ! [SY19: $i] : ( sK3_SY16 @ SY19 @ SY19 )
| ( sK3_SY16 @ sK1_SV1 @ sK2_SV2 ) )
= $false )
| ( ( sK1_SV1 = sK2_SV2 )
= $false ) ),
inference(extcnf_forall_neg,[status(esa)],[25]) ).
thf(28,plain,
! [SV3: $i > $i > $o] :
( ( ( SV3 @ ( sK4_SY18 @ SV3 ) @ ( sK4_SY18 @ SV3 ) )
= $false )
| ( ( SV3 @ sK1_SV1 @ sK2_SV2 )
= $true )
| ( ( sK1_SV1 = sK2_SV2 )
= $true ) ),
inference(extcnf_forall_neg,[status(esa)],[26]) ).
thf(29,plain,
( ( ( ~ ! [SY19: $i] : ( sK3_SY16 @ SY19 @ SY19 ) )
= $false )
| ( ( sK1_SV1 = sK2_SV2 )
= $false ) ),
inference(extcnf_or_neg,[status(thm)],[27]) ).
thf(30,plain,
( ( ( sK3_SY16 @ sK1_SV1 @ sK2_SV2 )
= $false )
| ( ( sK1_SV1 = sK2_SV2 )
= $false ) ),
inference(extcnf_or_neg,[status(thm)],[27]) ).
thf(31,plain,
( ( ( ! [SY19: $i] : ( sK3_SY16 @ SY19 @ SY19 ) )
= $true )
| ( ( sK1_SV1 = sK2_SV2 )
= $false ) ),
inference(extcnf_not_neg,[status(thm)],[29]) ).
thf(32,plain,
! [SV4: $i] :
( ( ( sK3_SY16 @ SV4 @ SV4 )
= $true )
| ( ( sK1_SV1 = sK2_SV2 )
= $false ) ),
inference(extcnf_forall_pos,[status(thm)],[31]) ).
thf(33,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[9,32,30,28,15,12]) ).
thf(34,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[33]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEV121^5 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.13/0.34 % Computer : n021.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jun 27 18:38:10 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.35
% 0.13/0.35 No.of.Axioms: 0
% 0.13/0.35
% 0.13/0.35 Length.of.Defs: 0
% 0.13/0.35
% 0.13/0.35 Contains.Choice.Funs: false
% 0.13/0.35 (rf:0,axioms:0,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:2,loop_count:0,foatp_calls:0,translation:fof_full)..
% 0.20/0.39
% 0.20/0.39 ********************************
% 0.20/0.39 * All subproblems solved! *
% 0.20/0.39 ********************************
% 0.20/0.39 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:0,axioms:0,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:33,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.20/0.39
% 0.20/0.39 %**** Beginning of derivation protocol ****
% 0.20/0.39 % SZS output start CNFRefutation
% See solution above
% 0.20/0.39
% 0.20/0.39 %**** End of derivation protocol ****
% 0.20/0.39 %**** no. of clauses in derivation: 34 ****
% 0.20/0.39 %**** clause counter: 33 ****
% 0.20/0.39
% 0.20/0.39 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:0,axioms:0,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:33,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------